Bch 2 : 00393

Some Hermitian Dual Containing BCH Codes and New Quantum Codes

Let q = 3l+2 be a prime power. Maximal designed distances of imprimitive Hermitian dual containing q2-ary narrow-sense (NS) BCH codes of length n = (q 6−1) 3 and n = 3(q 2 −1)(q2 +q+1) are determined. For each given n, non-narrow-sense (NNS) BCH codes which achieve such maximal designed distances are presented, and a series of NS and NNS BCH codes are constructed and their parameters are comput...

Complete Genome Sequence of vB_EcoM_112, a T-Even-Type Bacteriophage Specific for Escherichia coli O157:H7

Bacteriophage vB_EcoM_112 (formerly e11/2) is an Escherichia coli phage with specificity for the O157:H7 serotype. The vB_EcoM_112 genome sequence shares high degrees of similarity with the phage T4 genome sequence.

A simple approximation algorithm for the weighted matching problem

The dimension and minimum distance of two classes of primitive BCH codes

Reed-Solomon codes, a type of BCH codes, are widely employed in communication systems, storage devices and consumer electronics. This fact demonstrates the importance of BCH codes – a family of cyclic codes – in practice. In theory, BCH codes are among the best cyclic codes in terms of their error-correcting capability. A subclass of BCH codes are the narrow-sense primitive BCH codes. However, ...

Idempotent and Bch Bound

Using the characterization of the idempotents of a narrow-sense primitive binary BCH code, we are able to give classes of such codes whose minimum distance reaches the BCH bound. Let be a primitive element of GF(2 m). We denote R n = GF(2))x]=(x n ? 1), n = 2 m ? 1. 1 Binary BCH codes and locator polynomials 1.1 Primitive binary BCH codes For our purpose we only need to deene a particular class...